A bi-objective hybrid vibration damping optimization model for synchronous flow shop scheduling problems

نویسندگان

چکیده

Flow shop scheduling deals with the determination of optimal sequence jobs processing on machines in a fixed order main objective consisting minimizing completion time all (makespan). This type problem appears many industrial and production planning applications. study proposes new bi-objective mixed-integer programming model for solving synchronous flow problems time. The functions are total makespan sum tardiness earliness cost blocks. At same time, moved among through transportation system synchronized cycles. In each cycle, existing begin simultaneously, one machines, after completion, wait until last job is completed. Subsequently, concurrently to next machine. Four algorithms, including non-dominated sorting genetic algorithm (NSGA II), multi-objective simulated annealing (MOSA), particle swarm optimization (MOPSO), hybrid vibration-damping (MOHVDO), used find near-optimal solution this NP-hard problem. particular, proposed VDO based imperialist competitive (ICA) integration neighborhood creation technique. MOHVDO MOSA show best performance other algorithms regarding CPU Time, respectively. Thus, results from running small-scale medium-scale compared solutions obtained epsilon-constraint method. error percentage MOHVDO’s less than 2% method solved problems. Besides specific terms and, hence, practical applicability, approach fills considerable gap literature. Indeed, even though variants aforementioned meta-heuristic have been largely introduced environments, simultaneous implementation these as well their when has so far overlooked.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

This paper presents new, carefully designed algorithms for five biobjective permutation flow shop scheduling problems that arise from the pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) both, the weighted and nonweighted total tardiness of all jobs. The proposed algorithm combines two search methods, two-phase local search and Pa...

متن کامل

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine learning with applications

سال: 2023

ISSN: ['2666-8270']

DOI: https://doi.org/10.1016/j.mlwa.2022.100445